On a new properties of random number sequences ,a randomness test and a new RC4’s key scheduling algorithm
نویسندگان
چکیده
In this paper, we introduce the concept of the derivative of sequence of numbers and define new statistical indices by which we discoverd new properties of randomly generated number sequences. We also build a test for pseudo random generators based on these properties and use it to confirm the weakness of RC4 key scheduling algorithm that has been reported in the litterature. In this rescpect we publish a new RC4’s key scheduling algorithm that don’t have this weakness.
منابع مشابه
VMPC-R Cryptographically Secure Pseudo-Random Number Generator Alternative to RC4
We present a new Cryptographically Secure Pseudo-Random Number Generator. It uses permutations as its internal state, similarly to the RC4 stream cipher. We describe a statistical test which revealed non-random patterns in a sample of 2 outputs of a 3-bit RC4. Our new algorithm produced 2 undistinguishable from random 3-bit outputs in the same test. We probed 2 outputs of the algorithm in diffe...
متن کاملOn Non-randomness of the Permutation After RC4 Key Scheduling
Here we study a weakness of the RC4 Key Scheduling Algorithm (KSA) that has already been noted by Mantin and Mironov. Consider the RC4 permutation S of N (usually 256) bytes and denote it by SN after the KSA. Under reasonable assumptions we present a simple proof that each permutation byte after the KSA is significantly biased (either positive or negative) towards many values in the range 0, . ...
متن کاملAnalysis of FIPS 140-2 Test and Chaos-Based Pseudorandom Number Generator
Pseudo random numbers are used for various purposes. Pseudo random number generators (PRNGs) are useful tools to provide pseudo random numbers. The FIPS 140-2 test issued by the American National Institute of Standards and Technologyhas been widely used for the verifications the statistical properties of the randomness of the pseudo random numbers generated by PRNGs. First this paper analyzes t...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014